Recursion and double recursion

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical systems with double recursion are undecidable

A primitive type of dynamical system is introduced. It is shown that there is no decision procedure able to answer if any such dynamical system is ultimately zero. A.M.S.-Classification: 12L05.

متن کامل

The equivalence of bar recursion and open recursion

Several extensions of Gödel’s system T with new forms of recursion have been designed for the purpose of giving a computational interpretation to classical analysis. One can organise many of these extensions into two groups: those based on bar recursion, which include Spector’s original bar recursion, modified bar recursion and the more recent products of selections functions, or those based on...

متن کامل

Recursion and Recursion- Like Structure in Ensembles of Neural Elements

Connectionist models have used general principles to model phenomena across many mental domains. Thus, they seem promising for uniting diverse syntactic phenomena (e.g., language, music, action). A challenge has been understanding how recursion can work in neurons. Headway has been made in training Recurrent Neural Networks (RNNs) to process languages which can be handled by the use of one or m...

متن کامل

On recursion

It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely ...

متن کامل

Linear Recursion

We define two extensions of the typed linear lambda-calculus that yield minimal Turingcomplete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both approaches are compatible with linearity and typeability constraints. Both extensions of the typed linear lambda-calculus are minimal, in the sense that taking ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1948

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1948-09121-2